CS 710 : Complexity Theory 4 / 20 / 2010 Lecture 25 : Interactive Proofs
نویسندگان
چکیده
Last time we introduced the notion of interactive proof systems which models computation as a result of interaction between two parties. We defined public/private coin protocols, and showed that the graph non-isomorphism problem admits an interactive proof using private coins, as well as one using public coins. Today we will continue our discussion of interactive proof systems. We will study the power of bounded round interactive proof systems and of general interactive proof systems.
منابع مشابه
CS 710 : Complexity Theory 1 / 28 / 2010 Lecture 4 : Time - Bounded Nondeterminism
In the previous lecture, we discussed NP-completeness and gave some strong results pertaining to the complexity of SAT, viz. that it is complete for NP under a reduction computable in logarithmic space and polylogarithmic time, and that it is complete for NQLIN (the set of NP problems solvable in quasilinear time) under quasi-linear time mapping reductions. The conclusion that all naturally occ...
متن کاملProbabilistic Proof Systems Lecture Notes
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In these notes, we concentrate on three such proof systems | interactive proofs, zero-knowledge proofs, and probabilistic checkable proofs. Remark: These are lecture notes in the strict sense of the word. Surveys of mine on this subject can be obtained from URL http...
متن کاملCS 6180 : Lecture 4
We will briefly discuss the following major styles, already mentioned in Lecture 3. In the previous lecture we examined Hilbert style proofs, illustrated by Kleene’s axioms for first-order logic and elementary number theory. The number theory comes in two versions, Peano Arithmetic, PA that uses all of Kleene’s axioms and Heyting Arithmetic, HA which omits the “dreaded rule 8,” and is thus a co...
متن کاملCS 2429 - Foundations of Communication Complexity Lecture # 8 : 7 November 2012 Lecturer : Lila Fontes
Today we’ll cover some recent results from the paper Lower bounds on information complexity via zero-communication bounds and applications by Kerenidis, Laplante, Lerays, Roland, and Xiao (FOCS 2012). We’ll also recall results covered in past lectures from the papers The partition bound for classical communication complexity and query complexity by Jain and Klauck (CCC 2010) and How to compress...
متن کاملCS 2429 - Foundations of Communication Complexity Lecture # 7 : 31 October 2012 Lecturer : Lila Fontes
Another important technique for proving lower bounds in communication complexity comes from information theory. In Information Complexity and the Direct Sum Problem for Simultaneous Message Complexity (FOCS 2001), Chakrabarti, Shi, Wirth, and Yao introduced the notion of information complexity and used it to prove new lower bounds on the direct sum of the equality function. Follow-up work by Ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010